Extended Degree Functions and Monomial Modules
نویسنده
چکیده
The arithmetic degree, the smallest extended degree, and the homological degree are invariants that have been proposed as alternatives of the degree of a module if this module is not Cohen-Macaulay. We compare these degree functions and study their behavior when passing to the generic initial or the lexicographic submodule. This leads to various bounds and to counterexamples to a conjecture of Gunston and Vasconcelos, respectively. Particular attention is given to the class of sequentially Cohen-Macaulay modules. The results in this case lead to an algorithm that computes the smallest extended degree.
منابع مشابه
Monomial Irreducible sln-Modules
In this article, we introduce monomial irreducible representations of the special linear Lie algebra $sln$. We will show that this kind of representations have bases for which the action of the Chevalley generators of the Lie algebra on the basis elements can be given by a simple formula.
متن کاملFree Extended BCK-Module
In this paper, by considering the notion of extended BCK-module, we define the concepts of free extended BCK-module, free object in category of extended BCK-modules and we state and prove some related results. Specially, we define the notion of idempotent extended BCK-module and we get some important results in free extended BCK-modules. In particular, in category of idempotent extended BCK-mod...
متن کاملINTRODUCTION TO A THEORY OF b-FUNCTIONS
We give an introduction to a theory of b-functions, i.e. Bernstein-Sato polynomials. After reviewing some facts from D-modules, we introduce b-functions including the one for arbitrary ideals of the structure sheaf. We explain the relation with singularities, multiplier ideals, etc., and calculate the b-functions of monomial ideals and also of hyperplane arrangements in certain cases.
متن کاملSome Results on Bent-Negabent Boolean Functions over Finite Fields
We consider negabent Boolean functions that have Trace representation. We completely characterize quadratic negabent monomial functions. We show the relation between negabent functions and bent functions via a quadratic function. Using this characterization, we give infinite classes of bent-negabent Boolean functions over the finite field F2n , with the maximum possible degree, n 2 . These are ...
متن کاملAn e cient algorithm for evaluating polynomials in the P olya basis
A new O(n) algorithm is given for evaluating univariate polynomials of degree n in the P olya basis. Since the Lagrange, Bernstein, and monomial bases are all special instances of the P olya basis, this technique leads to e cient evaluation algorithms for these special bases. For the monomial basis, this algorithm is shown to be equivalent to Horner's rule. 1 P olya basis functions Let nk(t) be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004